Nonintrusive Remote Healing Using Backdoors
نویسندگان
چکیده
In this paper, we propose a remote healing approach for computer systems based on backdoors, a system architecture that supports monitoring and repair actions on a remote operating system or application memory image without using the processors of the target machine. A backdoor can be implemented using the remote memory communication technology provided by communication standards like Virtual Interface Architecture or In£niBand, speci£cally its support for remote DMA read and write operations. We discuss the potential and challenges of backdoor-based remote healing and describe a preliminary prototype we developed as proof of concept.
منابع مشابه
Nonintrusive Failure Detection and Recovery for Internet Services Using Backdoors
We describe an architecture for nonintrusive failure detection and recovery in a cluster of Internet servers in which nodes mutually monitor their liveness and recover client sessions from failed nodes. The system is based on Backdoors, a novel architectural approach for remote healing of computer systems. Backdoors enables monitoring and recovery/repair of state in a computer system by remote ...
متن کاملValidating Security Configurations and Detecting Backdoors in New Network Devices
With!the!discovery!of!admin!backdoors!in!network!devices!of!Barracuda!in!January! last!year,!it!once!again!has!become!apparent!that!internetPfacing!network!devices! are!vulnerable!to!unauthorized!remote!access.!It!was!found!that!80%!of!bestPselling! routers!have!security!vulnerabilities!that!may!be!exploited!to!gain!unauthorized! remote!access.!With!increasing!reports!of!router!vulnerabilities!...
متن کاملBackdoors in Satisfiability Problems
Although satisfiability problems (SAT) are NP-complete, state-of-the-art SAT solvers are able to solve large practical instances. The notion of backdoors has been introduced to capture structural properties of instances. Backdoors are a set of variables for which there exists some value assignment that leads to a polynomial-time solvable sub-problem. I address in this thesis the problem of find...
متن کاملSimple Backdoors on RSA Modulus by Using RSA Vulnerability
This investigation proposes two methods for embedding backdoors in the RSA modulus N = pq rather than in the public exponent e. This strategy not only permits manufacturers to embed backdoors in an RSA system, but also allows users to choose any desired public exponent, such as e = 216 +1, to ensure efficient encryption. This work utilizes lattice attack and exhaustive attack to embed backdoors...
متن کاملBackdoor Treewidth for SAT
A strong backdoor in a CNF formula is a set of variables such that each possible instantiation of these variables moves the formula into a tractable class. The algorithmic problem of finding a strong backdoor has been the subject of intensive study, mostly within the parameterized complexity framework. Results to date focused primarily on backdoors of small size. In this paper we propose a new ...
متن کامل